Understanding Control Flow with Concurrent Programming using μC++ (Draft)

class, 381abstraction, 25accept-blocked, 282, 339acceptingdaisy-chain, 291multiple, 291acceptor/signalled stack, 271, 275, 282, 284, 341Achermann, Wilhelm, 20acquire, 188, 191activation point, 91, 136Active, 93active, 80, 129, 266, 332active object, 327Actor model, 420acyclic graph, 16Ada, 1, 5, 33, 37, 44adaptive lock, 187Andrews, Gregory R., 214anthropomorphic, 349aperiodic task, 425applicative iterator, 26arbiter, 166atomicity, 145automatic-signal monitor, 295 bakery algorithm, 163barrier, 196baton passing, 216rules, 216binary semaphore, 201, 203, 205, 206, 210, 227binomial theorem, 334block, 198Blocked, 137blocked state, 129blocking monitor, 299blocking send, 390bottleneck, 125bound exception, 57bounded buffer, 209, 210, 261, 262, 269, 272, 276,292, 295, 329, 332, 336, 349break, 14labelled, 14Brinch Hansen, Per, 260, 263broadcast send, 391busy waiting, 140, 148, 169, 175, 186–188, 203,208, 221, 225, 261, 267, 335 C, 1, 2, 12, 34, 44, 51, 177, 180, 372, 374, 375C#, 1C++, 4, 33, 37, 44, 51, 52, 132, 136, 137, 168, 171,173, 175, 303, 335, 340call, 3call cycle, 16catch-any, 50caught, 37CloseFailure, 73CLU, 5, 33, 52cluster, 363COBEGIN, 133coding convention, 214, 216, 259, 291, 411COEND, 133communication, 80, 125, 128, 141, 166, 328, 345bidirectional, 141, 329, 331, 344direct, 328during execution, 139indirect, 328protocol, 140thread, 128unidirectional, 139communication variables, 80, 132compare-and-assign, 173